<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    21. Merge Two Sorted Lists
   </h1>
   <p>
    Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <pre>
<b>Input:</b> 1-&gt;2-&gt;4, 1-&gt;3-&gt;4
<b>Output:</b> 1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4
</pre>
  </div>
  <div>
   <h1 class="question_title">
    21. 合并两个有序链表
   </h1>
   <p>
    将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。&nbsp;
   </p>
   <p>
    <strong>
     示例：
    </strong>
   </p>
   <pre><strong>输入：</strong>1-&gt;2-&gt;4, 1-&gt;3-&gt;4
<strong>输出：</strong>1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4
</pre>
  </div>
 </body>
</html>